Path graph

Results: 1083



#Item
431Network flow / Network theory / Graph connectivity / Maximum flow problem / Graph / Connectivity / Shortest path problem / Tree / Flow network / Graph theory / Mathematics / Theoretical computer science

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ´ Colin de Verdi`ere Eric ´ Ecole

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2011-03-29 05:33:44
432NP-complete problems / Network theory / Operations research / Travelling salesman problem / Motion planning / Robotics / Shortest path problem / Mobile robot / Robot / Theoretical computer science / Mathematics / Graph theory

Ann Math Artif Intell:281–305 DOIs10472A framework for multi-robot node coverage in sensor networks Andrea Gasparri · Bhaskar Krishnamachari ·

Add to Reading List

Source URL: robotics.usc.edu

Language: English - Date: 2014-06-13 19:42:54
433Network theory / Distance / Shortest path problem / Tree / Network flow / Mathematics / Theoretical computer science / Graph theory

        On Compact Representations of          All­Pairs­Shortest­Path  Distance Matrices                 Igor Nitto and Rossano Venturini                  

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2008-06-19 13:08:02
434Search algorithms / Graph connectivity / Depth-first search / Topological sorting / Directed graph / Connected component / Graph / Shortest path problem / Connectivity / Graph theory / Mathematics / Combinatorics

CS109B Notes for LectureDepth-First Search   A method of exploring a directed graph and

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:41
435Intersection graph / Clique / Representation / Path decomposition / Trapezoid graph / Graph theory / Interval graph / Circle graph

On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs Minghui Jiang Utah State University CPM

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2010-08-20 17:45:36
436Distributed computing architecture / MapReduce / Parallel computing / NP-complete problems / PageRank / Eulerian path / Graph / Topological graph theory / Connected component / Graph theory / Mathematics / Theoretical computer science

Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu

Add to Reading List

Source URL: www.umiacs.umd.edu

Language: English - Date: 2010-08-02 09:34:23
437NP-complete problems / Clique / Matching / Maximal independent set / Independent set / Circuit complexity / Path decomposition / Bipartite dimension / Graph theory / Theoretical computer science / Mathematics

Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2012-06-27 11:58:26
438Network theory / Network topology / Topology / Node / Shortest path problem / Distributed computing / Connectivity / Flow network / Storage area network / Graph theory / Mathematics / Theoretical computer science

Generic and Automatic Address Configuration for Data ∗ Center Networks Kai Chen⋆† , Chuanxiong Guo† , Haitao Wu† , Jing Yuan‡⋆ , Zhenqian Feng♯† , Yan Chen⋆ , Songwu Lu§ , Wenfei Wu♮†

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2010-06-19 17:44:26
439Connected component / Planar graphs / Graph isomorphism problem / Graph theory / Network theory / Shortest path problem

The Stanford GraphBase: A Platform for Combinatorial Computing Donald E. Knuth, Stanford University A highly portable collection of programs and data is now available to researchers who study combinatorial algorithms and

Add to Reading List

Source URL: www.literateprogramming.com

Language: English - Date: 2007-10-09 02:25:27
440Artificial intelligence / Search algorithms / Network theory / Combinatorial optimization / Routing algorithms / Pathfinding / A* search algorithm / Shortest path problem / Heuristic function / Mathematics / Game artificial intelligence / Graph theory

Partial Pathfinding Using Map Abstraction and Refinement Nathan Sturtevant and Michael Buro Department of Computing Science, University of Alberta Edmonton, Alberta, Canada T6G 2E8 {nathanst,mburo}@cs.ualberta.ca

Add to Reading List

Source URL: www.societyofrobots.com

Language: English - Date: 2010-01-10 09:34:29
UPDATE